<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>sibgrapi.sid.inpe.br 802</site>
		<holdercode>{ibi 8JMKD3MGPEW34M/46T9EHH}</holdercode>
		<identifier>6qtX3pFwXQZG2LgkFdY/UMQEE</identifier>
		<repository>sid.inpe.br/sibgrapi@80/2008/07.17.22.39</repository>
		<lastupdate>2008:07.17.22.39.46 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatarepository>sid.inpe.br/sibgrapi@80/2008/07.17.22.39.48</metadatarepository>
		<metadatalastupdate>2022:06.14.00.13.44 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 2008}</metadatalastupdate>
		<doi>10.1109/SIBGRAPI.2008.7</doi>
		<citationkey>LageBoPeVeTaLeLo:2008:ApSmTr</citationkey>
		<title>Approximations by Smooth Transitions in Binary Space Partitions</title>
		<format>Printed, On-line.</format>
		<year>2008</year>
		<numberoffiles>1</numberoffiles>
		<size>2465 KiB</size>
		<author>Lage, Marcos,</author>
		<author>Bordignon, Alex,</author>
		<author>Petronetto, Fabiano,</author>
		<author>Veiga, Alvaro,</author>
		<author>Tavares, Geovan,</author>
		<author>Lewiner, Thomas,</author>
		<author>Lopes, Hélio,</author>
		<affiliation>Department of Mathematics, PUC–Rio de Janeiro, Brazil</affiliation>
		<affiliation>Department of Mathematics, PUC–Rio de Janeiro, Brazil</affiliation>
		<affiliation>Department of Mathematics, PUC–Rio de Janeiro, Brazil</affiliation>
		<affiliation>Department of Electrical Engineering, PUC–Rio de Janeiro, Brazil</affiliation>
		<affiliation>Department of Mathematics, PUC–Rio de Janeiro, Brazil</affiliation>
		<affiliation>Department of Mathematics, PUC–Rio de Janeiro, Brazil</affiliation>
		<affiliation>Department of Mathematics, PUC–Rio de Janeiro, Brazil</affiliation>
		<editor>Jung, Cláudio Rosito,</editor>
		<editor>Walter, Marcelo,</editor>
		<conferencename>Brazilian Symposium on Computer Graphics and Image Processing, 21 (SIBGRAPI)</conferencename>
		<conferencelocation>Campo Grande, MS, Brazil</conferencelocation>
		<date>12-15 Oct. 2008</date>
		<publisher>IEEE Computer Society</publisher>
		<publisheraddress>Los Alamitos</publisheraddress>
		<booktitle>Proceedings</booktitle>
		<tertiarytype>Full Paper</tertiarytype>
		<transferableflag>1</transferableflag>
		<versiontype>finaldraft</versiontype>
		<keywords>Binary Space Partitions, Smooth Transition Regression Trees, Classification and Regression Tree.</keywords>
		<abstract>This work proposes a simple approximation scheme for discrete data that leads to an in&#64257;nitely smooth result without global optimization. It combines the &#64258;exibility of Binary Space Partitions Trees with the statistical robustness of Smooth Transition Regression Trees. The construction of the tree is straightforward and easily controllable, using error-driven metrics or external constraints. Moreover, it leads to a concise representation. Applications on synthetic and real data, both scalar and vector-valued demonstrated the effectiveness of this approach.</abstract>
		<language>en</language>
		<targetfile>lewiner-bsp.pdf</targetfile>
		<usergroup>tomlew@mat.puc-rio.br administrator</usergroup>
		<visibility>shown</visibility>
		<mirrorrepository>sid.inpe.br/banon/2001/03.30.15.38.24</mirrorrepository>
		<nexthigherunit>8JMKD3MGPEW34M/46SG4TH</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/4742MCS</nexthigherunit>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/05.14.04.55 3</citingitemlist>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/sibgrapi@80/2008/07.17.22.39</url>
	</metadata>
</metadatalist>